An Emotion Processing Model using Multiple Valued Logic Functions
نویسندگان
چکیده
منابع مشابه
Compact SOP Representations for Multiple-Output Functions: An Encoding Method Using Multiple-Valued Logic
This paper shows a method to represent a multipleoutput function: Encoded characteristic function for nonzero outputs (ECFN). The ECFN uses (n+ u) binary variables to represent an n-input m-output function, where u = dlog2 me. The size of the sum-of-products expressions (SOPs) depends on the encoding method of the outputs. For some class of functions, the optimal encoding produces SOPs with O(n...
متن کاملMultiple-valued Logic
s of the Talks In the order in which the talks were given. Walter Carnielli – Non-deterministic Semantics 5 Matthias Baaz – Analytic Calculi for Many-valued Logics 5 Hiroakira Ono – Many-valued Logics as Logics without the Contraction Rule 6 Reiner Hähnle – Proof Theory of Many-valued Logic and Hardware Design 7 Gonzalo Escalada-Imaz – Determining the Truth Degree in Real Time Settings 7 Peter ...
متن کاملMultiple-Valued Logic in FPGAs
This paper considers the applicability of multiple-valued logic (MVL) circuits in implementation of field-programmable gate arrays (FPGAs). It proposes an FPGA logic block architecture that features MVL current-mode CMOS circuitry. The logic block combines the lookup-table and multiplexer approaches found in commercial FPGAs, and provides additional versatility through its current-mode operatio...
متن کاملCascade Realizations of Two-valued Input Multiple-Valued Output Functions using Decomposition of Group Functions
This paper considers a method to realize a two-valued input three-valued output function by using a cascade of four-input cells. Decomposition of a group function is used to find a canonical form. We show that the Walsh spectrum specifies the canonical form, and the number of non-zero coefficients in the spectrum is proportional to the number of cells in the cascade. Finally, we show an extensi...
متن کاملMultiple-Valued Logic Minimization using Universal Literals and Cost Tables
We propose a minimization algorithm that combines cost tables and simulated annealing. Unlike other minimization procedures that use cost tables, our method does not rely on the enumeration of all minterms, it works directly with the expression (a sum of product terms). We tested our method with a cost table obtained from current mode CMOS. The algorithm can be readily adapted to any other tech...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Intelligent Systems
سال: 2009
ISSN: 1976-9172
DOI: 10.5391/jkiis.2009.19.1.013